Attribute Allocation and Retrieval Scheme for Large-Scale Sensor Networks

Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes.     

Compile-time copy elimination

Single-assignment and functional languages have value semantics that do not permit side-effects. This lack of side-effects makes automatic detection of parallelism and optimization for data locality in programs much easier. However, the same property poses a challenge in implementing these languages efficiently. This paper describes an optimizing compiler system that solves the key problem of aggregate copy elimination. The methods developed rely exclusively on compile-time algorithms, including interprocedural analysis, that are applied to an intermediate data flow representation. By dividing the problem into update-in-place and build-in-place analysis, a small set of relatively simple techniques—edge substitution, graph pattern matching, substructure sharing and substructure targeting—was found to be very powerful. If combined properly and implemented carefully, the algorithms eliminate unnecessary copy operations to a very high degree. No run-time overhead is imposed on the compiled programs.     

用APACHE+PHP+MYSQL实现网站自动更新

在分析建立自动更新网站必要性的基础上,较详细地说明了如何利用APACHE+PHP+MYSQL工具实现网站自动更新中的权限控制、资料上传、自动更新,并给出了网页的部分源代码.     

基于CPX8216硬件平台的GPRS板间切换的实现

GPRS全称通用分组无线业务,它在改进了现有GSM系统后能实现高速的数据传输。首先对GPRS系统做了简单介绍,然后在此基础上详细介绍了GPRS的板间切换在CPX8216硬件平台上的实现方法。     

Efficient return algorithms for associated plasticity with multiple yield planes

A new return method for implicit integration of linear isotropic yield criteria is presented. The basic idea is to perform all the manipulations in the principal stress space and thereby achieve very simple formulae for calculating the plastic corrector stresses, based on the constant gradient of such criteria. The return formulae are in closed form and no iteration is required. The method accounts for three types of stress return: return to a single yield plane, to a discontinuity line at the intersection of two yield planes and to a discontinuity point at the intersection between three or more yield planes. The infinitesimal and the consistent elastoplastic constitutive matrix are calculated for each type of stress return, as are the conditions to ascertain which type of return is required. The method is exemplified with the Mohr–Coulomb yield criterion. Copyright © 2005 John Wiley & Sons, Ltd.     

Protecting against key-exposure: strongly key-insulated encryption with optimal threshold

Key-insulated encryption schemes use a combination of key splitting and key evolution to protect against key exposure. Existing schemes, however scale poorly, having cost proportional to the number t of time periods that may be compromised by the adversary, and thus are practical only for small values of t. Yet in practice t might be large. This paper presents a strongly key-insulated encryption scheme with optimal threshold. In our scheme, t need not be known in advance and can be as large as one less than the total number of periods, yet the cost of the scheme is not impacted. This brings key-insulated encryption closer to practice. Our scheme is based on the Boneh-Franklin identity-based encryption (IBE) scheme [9], and exploits algebraic properties of the latter. Another contribution of this paper is to show that (not strongly) key-insulated encryption with optimal threshold and allowing random-access key updates (which our scheme and all others known allow) is equivalent to a restricted form of IBE. This means that the connection between key-insulated encryption and IBE is not accidental. Supported in part by NSF grants CCR-0098123, ANR-0129617 and CCR-0208842, and by an IBM Faculty Partnership Development Award. Supported in part by an NSF graduate fellowship.     

An efficient return algorithm for non-associated plasticity with linear yield criteria in principal stress space

An efficient return algorithm for stress update in numerical plasticity computations is presented. The yield criterion must be linear in principal stress space and can be composed of any number of yield planes. Each of these yield planes may have an associated or non-associated flow rule. The stress return and the formation of the constitutive matrix is carried out in principal stress space. Here the manipulations simplify and rely on geometrical arguments. The singularities arising at the intersection of yield planes are dealt with in a straightforward way also based on geometrical considerations. The method is exemplified on non-associated Mohr–Coulomb plasticity throughout the paper.     

多特征自适应融合的粒子滤波跟踪算法

针对跟踪过程中目标形态不断变化或部分遮挡导致鲁棒性差的问题,提出一种基于多特征自适应融合的粒子滤波跟踪算法.该算法从视觉特征集中选取了描述能力强的2种特征,并将其按照与目标模型的多尺度相似度进行线性融合;为了减小跟踪漂移,通过计算当前目标模型与初始目标模型的多尺度相似度自适应地更新目标模型.大量仿真实验结果表明,文中算法可以鲁棒地跟踪到部分遮挡和形态变化的运动目标.     

利用RSS推送的主动服务解决藏书呆滞的研究

将通过系统提取的读者兴趣及需求信息与不断更新的RSS资源库进行比对,筛选出最能满足用户要求的RSS信息,并通过RSS主动推送技术,将资源及时发送给读者,是提高馆藏图书利用率,减少图书呆滞量的一种有效途径。